The 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Order 2 and Period pq
نویسندگان
چکیده
منابع مشابه
Lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$
Let p be an odd prime, n a positive integer and g a primitive root of pn. Suppose D (p) i = {g 2s + i|s = 0, 1, 2, · · · , (p−1)p n−1 2 }, i = 0, 1 is the generalized cyclotomic classes with Z∗ pn = D0 ∪D1. In this paper, we prove that Gauss periods based on D0 and D1 are both equal to 0 for n ≥ 2. As an application, we determine a lower bound on the 2-adic complexity of generalized cyclotomic ...
متن کاملOn the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six
We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will find the linear complexity of DingHelleseth-generalized cyclotomic sequences of order four and six and make the results of Tongjiang Yan et. al [19] about the sequences of order four more specific. 2010 Mathematics Subject Classifications: 11B50, 9...
متن کاملLinear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
During the last two decades, many kinds of periodic sequences with good pseudo-random properties have been constructed from classical and generalized cyclotomic classes, and used as keystreams for stream ciphers and secure communications. Among them are a family DH-GCSd of generalized cyclotomic sequences on the basis of Ding and Helleseth’s generalized cyclotomy, of length pq and order d = gcd...
متن کاملLinear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
This paper gives the linear complexity of binary Ding-Helleseth generalized cyclo-tomic sequences of any order.
متن کاملLinear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes
A family of quaternary sequences over Z4 is defined based on the DingHelleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3012570